Non-malleable Encryption: Simpler, Shorter, Stronger
نویسندگان
چکیده
منابع مشابه
Non-Malleable Encryption: Simpler, Shorter, Stronger
In a seminal paper, Dolev et al. [15] introduced the notion of non-malleable encryption (NM-CPA). This notion is very intriguing since it suffices for many applications of chosen-ciphertext secure encryption (IND-CCA), and, yet, can be generically built from semantically secure (IND-CPA) encryption, as was shown in the seminal works by Pass et al. [29] and by Choi et al. [9], the latter of whic...
متن کاملCompletely Non-malleable Encryption Revisited
Several security notions for public-key encryption schemes have been proposed so far, in particular considering the powerful adversary that can play a so called “man-in-the-middle” attack. In this paper we extend the notion of completely non-malleable encryption introduced in [Fischlin, ICALP 05]. This notion immunizes a scheme from adversaries that can generate related ciphertexts under new pu...
متن کاملInception Makes Non-malleable Codes Stronger
Non-malleable codes (NMCs), introduced by Dziembowski, Pietrzak and Wichs [DPW10], provide a useful message integrity guarantee in situations where traditional error-correction (and even errordetection) is impossible; for example, when the attacker can completely overwrite the encoded message. NMCs have emerged as a fundamental object at the intersection of coding theory and cryptography. A lar...
متن کاملBounded CCA2-Secure Non-Malleable Encryption
Under an adaptive chosen ciphertext attack (CCA2), the security of an encryption scheme must hold against adversaries that have access to a decryption oracle. We consider a weakening of CCA2 security, wherein security need only hold against adversaries making an a-priori bounded number of queries to the decryption oracle. Concerning this notion, which we call bounded-CCA2 security, we show the ...
متن کاملNon-malleable encryption of quantum information
Andris Ambainis,1, 2 Jan Bouda,3 and Andreas Winter4, 5 Department of Computer Science, University of Latvia, Raina bulv. 19, Riga, LV-1586, Latvia Department of Combinatorics and Optimization & Institute for Quantum Computing, University of Waterloo Faculty of Informatics, Masaryk University, Botanická 68a, 602 00 Brno, Czech Republic Department of Mathematics, University of Bristol, Bristol B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2020
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-020-09361-0